Making a dominating set of a graph connected
نویسندگان
چکیده
منابع مشابه
On connected dominating set games †
Many authors studied cooperative games that arise from variants of dominating set games on graphs. In wireless networks, the connected dominating set is used to reduce routing table size and communication cost. In this paper, we introduce a connected dominating set game to model the cost allocation problem arising from a connected dominating set on a given graph and study its core. In addition,...
متن کاملPartitioning a Graph into a Dominating Set, a Total Dominating Set, and something else 1Michael
A recent result of Henning and Southey (A note on graphs with disjoint dominating and total dominating set, Ars Comb. 89 (2008), 159–162) implies that every connected graph of minimum degree at least three has a dominating set D and a total dominating set T which are disjoint. We show that the Petersen graph is the only such graph for which D ∪ T necessarily contains all vertices of the graph.
متن کاملA Better Theoretical Bound to Approximate Connected Dominating Set in Unit Disk Graph
Connected Dominating Set is widely used as virtual backbone in wireless Ad-hoc and sensor networks to improve the performance of transmission and routing protocols. Based on special characteristics of Ad-hoc and sensor networks, we usually use unit disk graph to represent the corresponding geometrical structures, where each node has a unit transmission range and two nodes are said to be adjacen...
متن کاملAnonymous Self-Stabilizing Distributed Algorithms for Connected Dominating Set in a Network Graph∗
A self-stabilizing algorithm is a distributed algorithm where there is neither coordination nor initialization but the network achieves some global state. A connected dominating set (CDS) of a graph is a subset S of the nodes such that the subgraph induced by S is connected and every other node in the graph is adjacent to some node of S. A CDS is suitable as a spine or subset for communication....
متن کاملConstructing Minimum Connected Dominating Set: Algorithmic approach
Connected Dominating Set is popularly used for constructing virtual backbones for broadcasting operation in WSNs. UD Graph is the most suitable model for a wireless sensor network. In this paper we provide an algorithm to find MCDS in UD Graph. It is based on the computation of convex hulls of sensor nodes or vertices. Constructing a virtual backbone in WSNs is an important issue because it red...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discussiones Mathematicae Graph Theory
سال: 2018
ISSN: 1234-3099,2083-5892
DOI: 10.7151/dmgt.2053